Sigma predicates of finite types
نویسندگان
چکیده
منابع مشابه
Separation Logic Predicates for Aggregate Data Types
Many imperative languages have type systems built from a few elementary types with rules for building aggregate types. In C, integers, floating point numbers, and pointers are elementary types; struct, union and array build aggregates. When using separation logic to write assertions for such languages, one uses separating conjunction ∗ to describe aggregate values in memory. These conjunctions ...
متن کاملConstructive Membership Predicates as Index Types
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of typ...
متن کاملFinite State Transducers with Predicates and Identities
An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols. The extension is motivated by applications in natural language processing (but may be more widely applicable) as well as by the observation that transducers with predicates generally have fewer states and fewer transitions. Although the extension is fairly trivial fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01201-6